Armentum: a hybrid direct search optimization methodology

Authors

  • Francisco Zorrilla Briones Graduate School, Instituto Tecnológico de Ciudad Juárez, Juárez, México
  • Inocente Yuliana Mele´ndez Pastrana Industrial Processes Department, Universidad Tecnológica de Ciudad Juárez, Juárez, México
  • Jaime Sa´nchez Leal Graduate School, Instituto Tecnológico de Ciudad Juárez, Juárez, México
Abstract:

Design of experiments (DOE) offers a great deal of benefits to any manufacturing organization, such as characterization of variables and sets the path for the optimization of the levels of these variables (settings) trough the Response surface methodology, leading to process capability improvement, efficiency increase, cost reduction. Unfortunately, the use of these methodologies is very limited due to various situations. Some of these situations involve the investment on production time, materials, personnel, equipment; most of organizations are not willing to invest in these resources or are not capable because of production demands, besides the fact that they will produce non-conformant product (scrap) during the process of experimentation. Other methodologies, in the form of algorithms, may be used to optimize a process. Known as direct search methods, these algorithms search for an optimum on an unknown function, trough the search of the best combination of the levels on the variables considered in the analysis. These methods have a very different application strategy, they search on the best combination of parameters, during the normal production run, calculating the change in the input variables and evaluating the results in small steps until an optimum is reached. These algorithms are very sensible to internal noise (variation of the input variables), among other disadvantages. In this paper it is made a comparison between the classical experimental design and one of these direct search methods, developed by Nelder and Mead (1965), known as the Nelder Mead simplex (NMS), trying to overcome the disadvantages and maximize the advantages of both approaches, trough a proposed combination of the two methodologies.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Erratum to: Armentum: a hybrid direct search optimization methodology

In the original publication of this article unfortunately the co-authors were omitted. The two co-authors are displayed now.

full text

Hybrid Probabilistic Search Methods for Simulation Optimization

Discrete-event simulation based optimization is the process of finding the optimum design of a stochastic system when the performance measure(s) could only be estimated via simulation. Randomness in simulation outputs often challenges the correct selection of the optimum. We propose an algorithm that merges Ranking and Selection procedures with a large class of random search methods for continu...

full text

A Direct Search Algorithm for Global Optimization

A direct search algorithm is proposed for minimizing an arbitrary real valued function. The algorithm uses a new function transformation and three simplex-based operations. The function transformation provides global exploration features, while the simplex-based operations guarantees the termination of the algorithm and provides global convergence to a stationary point if the cost function is d...

full text

A HYBRID CHARGED SYSTEM SEARCH - FIREFLY ALGORITHM FOR OPTIMIZATION OF WATER DISTRIBUTION NETWORKS

Water distribution networks are one of the important and costly infrastructures of cities and many meta-heuristic algorithms in standard or hybrid forms were used for optimizing water distribution networks. These algorithms require a large amount of computational cost. Therefore, the converging speed of algorithms toward the optimization goal is as important as the goal itself. In this paper, a...

full text

Direct Search Algorithms for Optimization Calculations 1

Many diierent procedures have been proposed for optimization calculations when rst derivatives are not available. Further, several researchers have contributed to the subject, including some who wish to prove convergence theorems , and some who wish to make any reduction in the least calculated value of the objective function. There is not even a key idea that can be used as a foundation of a r...

full text

Optimization by direct search in matrix computations

A direct search method attempts to maximize a function f l R using function values only. Many questions about the stability and accuracy of algorithms in matrix computations can be expressed in terms of the maximum value of some easily computable function f. For a variety of algorithms it is shown that direct search is capable of revealing instability or poor performance, even when such failure...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 12  issue 4

pages  -

publication date 2016-12-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023